import javax.swing.tree.TreeNode;
import java.util.Deque;
import java.util.LinkedList;
import java.util.Queue;

public class work {
    /*
判断一棵树是不是完全二叉树
*/
    public boolean LCA(TreeNode root) {
        if(root == null)
        {
            return true;
        }
        Queue<TreeNode> queue= new LinkedList();
        queue.offer(root);
        while(!queue.isEmpty())
        {
            TreeNode cur = queue.poll();;
            if(queue.poll()!=null)
            {
                queue.offer(cur.left);
            }
        }

    }
}
